///
// * jdbm LICENSE v1.00
// *
// * Redistribution and use of this software and associated documentation
// * ("Software"), with or without modification, are permitted provided
// * that the following conditions are met:
// *
// * 1. Redistributions of source code must retain copyright
// *    statements and notices.  Redistributions must also contain a
// *    copy of this document.
// *
// * 2. Redistributions in binary form must reproduce the
// *    above copyright notice, this list of conditions and the
// *    following disclaimer in the documentation and/or other
// *    materials provided with the distribution.
// *
// * 3. The name "jdbm" must not be used to endorse or promote
// *    products derived from this Software without prior written
// *    permission of Cees de Groot.  For written permission,
// *    please contact cg@cdegroot.com.
// *
// * 4. Products derived from this Software may not be called "jdbm"
// *    nor may "jdbm" appear in their names without prior written
// *    permission of Cees de Groot.
// *
// * 5. Due credit should be given to the jdbm Project
// *    (http://jdbm.sourceforge.net/).
// *
// * THIS SOFTWARE IS PROVIDED BY THE ndbm PROJECT AND CONTRIBUTORS
// * ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT
// * NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
// * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL
// * CEES DE GROOT OR ANY CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
// * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
// * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
// * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
// * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
// * OF THE POSSIBILITY OF SUCH DAMAGE.
// *
// * Copyright 2000 (C) Cees de Groot. All Rights Reserved.
// * Contributions are Copyright (C) 2000 by their associated contributors.
// *
// 

//*************************************************************************
//**  Included in JDMB 1.0 port to SharpDBM;  11/2013 Cyrus Neah cneah@codingreal.com
//**  SharpDBM is an independent reimplementation of the JDBM 1.0 software library  
//*************************************************************************

using System;
using System.Collections;
using SharpDBM;
using SharpDBM.recman;
using SharpDBM.helper;
using SharpDBM.btree;
using SharpDBM.htree;



namespace SharpDBM.Test

.htree
{

	using RecordManager = SharpDBM.RecordManager;
	using RecordManagerFactory = SharpDBM.RecordManagerFactory;
    using TestRecordFile = SharpDBM.Test.recman.TestRecordFile;
	using FastIterator = SharpDBM.helper.FastIterator;
	using NUnit.Framework;

///
// *  This class contains all Unit tests for {@link HashDirectory}.
// *
// *  @author <a href="mailto:boisvert@intalio.com">Alex Boisvert</a>
// *  @version $Id: TestHashDirectory.java,v 1.2 2003/09/21 15:49:02 boisvert Exp $
// 
    [TestFixture]
	public class TestHashDirectory  
	{


        [Test]
		public virtual void setUp()
		{
			TestRecordFile.deleteTestFile();
		}
        [Test]
		public virtual void tearDown()
		{
			TestRecordFile.deleteTestFile();
		}


//    *
//     *  Basic tests
//     
 
//
        [Test]
        public virtual void testBasics()
		{
			Console.WriteLine("testBasics");

			   
			RecordManager recman = RecordManagerFactory.createRecordManager(TestRecordFile.testFileName );

			HashDirectory dir = new HashDirectory((sbyte)0);
			long recid = recman.insert(dir);
			dir.setPersistenceContext(recman, recid);

			dir.put("key", "value");
			string s = (string)dir.get("key");
			NUnit.Framework.Assert.AreEqual("value", s);

			recman.close();
		}

//    *
//     *  Mixed tests
//     
 
//
        [Test]
        public virtual void testMixed()
		{
			Console.WriteLine("testMixed");

			   
			RecordManager recman = RecordManagerFactory.createRecordManager(TestRecordFile.testFileName );
			HashDirectory dir = new HashDirectory((sbyte)0);
			long recid = recman.insert(dir);
			dir.setPersistenceContext(recman, recid);

			Hashtable hash = new Hashtable(); // use to compare results

			int max = 30; // must be even

		// insert & check values
			for (int i=0; i<max; i++)
			{
				dir.put("key"+i, "value"+i);
				hash["key"+i] = "value"+i;
			}
			recman.commit();

			for (int i=0; i<max; i++)
			{
				string s = (string)dir.get("key"+i);
				NUnit.Framework.Assert.AreEqual("value"+i, s);
			}
			recman.commit();

		// replace only even values
			for (int i=0; i<max; i+=2)
			{
				dir.put("key"+i, "value"+(i*2+1));
				hash["key"+i] = "value"+(i*2+1);
			}
			recman.commit();

			for (int i=0; i<max; i++)
			{
				if ((i%2) == 1)
				{
				// odd
					string s = (string)dir.get("key"+i);
					NUnit.Framework.Assert.AreEqual("value"+i, s);
				}
				else
				{
				// even
					string s = (string)dir.get("key"+i);
					NUnit.Framework.Assert.AreEqual("value"+(i*2+1), s);
				}
			}
			recman.commit();

		// remove odd numbers
			for (int i=1; i<max; i+=2)
			{
				dir.remove("key"+i);
				hash.Remove("key"+i);
			}
			recman.commit();

			for (int i=0; i<max; i++)
			{
				if ((i%2) == 1)
				{
				// odd
					string s = (string)dir.get("key"+i);
					NUnit.Framework.Assert.AreEqual(null, s);
				}
				else
				{
				// even
					string s = (string)dir.get("key"+i);
					NUnit.Framework.Assert.AreEqual("value"+(i*2+1), s);
				}
			}
			recman.commit();

			recman.close();
			recman = null;
		}

 
//
		internal virtual void checkEnumerations(Hashtable hash, HashDirectory dir)
		{
		// enumeration test

			FastIterator iter;
			Hashtable clone;
			int count;

		// test keys

			clone = (Hashtable) hash.Clone();
			count = 0;
			iter = dir.keys();
			string s = (string) iter.next();
			while (s != null)
			{
				count++;
				clone.Remove(s);
				s = (string) iter.next();
			}
			NUnit.Framework.Assert.AreEqual(hash.Count, count);

		// test values

			clone = (Hashtable)hash.Clone();
			count = 0;
			iter = dir.values();
			s = (string) iter.next();
			while (s != null)
			{
				count++;
				clone.Remove(s);
				s = (string) iter.next();
			}
			NUnit.Framework.Assert.AreEqual(hash.Count, count);
		}

//    *
//     *  Runs all tests in this class
//     
		static void Main(string[] args)
		{
			// junit.textui.TestRunner.run(new TestSuite(typeof(TestHashDirectory)));
		}

	}

}